Least squares shadowing sensitivity analysis of a modified Kuramoto–Sivashinsky equation
نویسندگان
چکیده
منابع مشابه
Least Squares Shadowing sensitivity analysis of chaotic limit cycle oscillations
The adjoint method, among other sensitivity analysis methods, can fail in chaotic dynamical systems. The result from these methods can be too large, often by orders of magnitude, when the result is the derivative of a long time averaged quantity. This failure is known to be caused by ill-conditioned initial value problems. This paper overcomes this failure by replacing the initial value problem...
متن کاملSensitivity analysis on chaotic dynamical systems by Non-Intrusive Least Squares Shadowing (NILSS)
This paper develops the tangent Non-Intrusive Least Square Shadowing (NILSS) method, which computes the sensitivity for long-time averaged objectives in chaotic dynamical systems. In NILSS, we represent a tangent solution as a linear combination of a inhomogeneous tangent solution and some homogeneous tangent solutions. Then we solve a least square problem under this new representation. NILSS i...
متن کاملRank based Least-squares Independent Component Analysis
In this paper, we propose a nonparametric rank-based alternative to the least-squares independent component analysis algorithm developed. The basic idea is to estimate the squared-loss mutual information, which used as the objective function of the algorithm, based on its copula density version. Therefore, no marginal densities have to be estimated. We provide empirical evaluation of th...
متن کاملculculation of scs infiltration equation by least-squares method
soil conservation service (scs) adjusted the kostiakovs infiltration model by adding a constant coefficient, for improvement of estimation. the improved model has three constant parameters, which are difficult to calculate. so scs has taken the third constant parameter as equal to 0.65-0.7 cm to simplify the estimation. this parameter varies in different soil and often outranges the scs estimat...
متن کاملThe Sensitivity of Least Squares Polynomial Approximation
Given integers N n 0, we consider the least squares problem of nding the vector of coeecients ~ P with respect to a polynomial basis P N j=0 wn(zj) 2 jf(zj) ? P (zj)j 2. Here a perturbation of the values f(zj) leads to some perturbation of the coeecient vector ~ P. We denote by n the maximal magniication of relative errors, i.e., the Euclidean condition number of the underlying weighted Vanderm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos, Solitons & Fractals
سال: 2014
ISSN: 0960-0779
DOI: 10.1016/j.chaos.2014.03.005